On-Line Analytical Processing on Graphs Generated from Social Network Data
نویسندگان
چکیده
Social Network services have quickly become a powerful means by which people share real-time messages. Typically, social networks are modeled as large underlying graphs. Responding to this emerging trend, it becomes critically important to interactively view and analyze this massive amount of data from different perspectives and with multiple granularities. While Online analytical processing (OLAP) is a powerful primitive for structured data analysis, it faces major challenges in manipulating this complex interconnecting data. In this paper, we suggest a new data warehousing model, namely Social Graph Cube to support OLAP technologies on multidimensional social networks. Based on the proposed model we represent data as heterogeneous information graphs for more comprehensive illustration than the traditional OLAP technology. Going beyond traditional OLAP operations, Social Graph Cube proposes a new method that combines data mining area and OLAP operators to navigate through dimension hierarchies. Experimental results show the effectiveness of Social Graph Cube for decision-making.
منابع مشابه
Design and Test of the Real-time Text mining dashboard for Twitter
One of today's major research trends in the field of information systems is the discovery of implicit knowledge hidden in dataset that is currently being produced at high speed, large volumes and with a wide variety of formats. Data with such features is called big data. Extracting, processing, and visualizing the huge amount of data, today has become one of the concerns of data science scholar...
متن کاملAn Introduction to Temporal Graph Data Management
This paper presents an introduction to the problem of temporal graph data management in the form of a survey of relevant techniques from database management and graph processing. Social network analytics, which focuses on finding interesting facts over static graphs, has gathered much attention lately. However, there hasn’t been much work on analysis of temporal or evolving graphs. We believe t...
متن کاملRevisiting Degree Distribution Models for Social Graph Analysis
Degree distribution models are incredibly important tools for analyzing and understanding the structure and formation of social networks, and can help guide the design of efficient graph algorithms. In particular, the Power-law degree distribution has long been used to model the structure of online social networks, and is the basis for algorithms and heuristics in graph applications such as inf...
متن کاملThe Domination Number of On-line Social Networks and Random Geometric Graphs
We consider the domination number for on-line social networks, both in a stochastic network model, and for real-world, networked data. Asymptotic sublinear bounds are rigorously derived for the domination number of graphs generated by the memoryless geometric protean random graph model. We establish sublinear bounds for the domination number of graphs in the Facebook 100 data set, and these bou...
متن کاملReally Big Data: Analytics on Graphs with Trillions of Edges (Keynote Abstract)
Big graphs occur naturally in many applications, most obviously in social networks, but also in many other areas such as biology and forensics. Current approaches to processing large graphs use either supercomputers or very large clusters. In both cases the entire graph must reside in memory before it can be processed. We are pursuing an alternative approach, processing graphs from secondary st...
متن کامل